The complexity of skewlinear tuple languages and o-regular languages

Combinatorial Complexity of Regular Languages

Quotient Complexity of Regular Languages

The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is appropriate to define it in formal-language terms as the number of distinct quotients of the language, and to call it “quotient complexity”. The problem of ...

State Complexity of Regular Languages

State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.

Reversal of regular languages and state complexity

We study the state complexity of languages that can be obtained as reversals of regular languages represented by deterministic finite automata. We show that the state complexity of the reversal of a regular language with state complexity n is between logn and 2. We first prove that the upper bound is tight in the ternary case. Then we present binary languages reaching this upper bound on the re...

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...